package myjava.algorithm.leetcode;

class DoubleLinkList
{
	DoubleLinkList next;
	DoubleLinkList prev;
	int val;
	
	public DoubleLinkList (int x)
	{
		val = x;
		next = null;
		prev = null;
	}
}

class LRUCache {
    public int capacity;
    private DoubleLinkList head = null;
    private DoubleLinkList tail = null;
    
    public LRUCache(int capacity) {
        this.capacity = capacity;
    }
    
    public int get(int key) {
        if(head == null && tail == null)
            return -1;

        
        
        return -1;
    }
    
    public void set(int key, int value) {
        
    }
}

public class LRUAlgorithm {

}
